Wait-free Computing
نویسنده
چکیده
Abs t r ac t . This tutorial has two independent parts. The first part (Sections 1, 2, 3, and 4) is aimed at introducing beginning graduate students to the subject of wait-free synchronization. It explores some important questions that have been studied and the techniques to solve them. The second part (Section 5) is a tutorial on robust walt-free hierarchies. It explains the motivation for studying such hierarchies and presents known results on this subject in one unified framework.
منابع مشابه
Transparent Support for Wait-Free Transactions
This paper concerns software support for non-blocking transactions in shared-memory multiprocessors. We present mechanisms that convert sequential transactions into lock-free or wait-free ones. In contrast to some previous mechanisms, ours support transactions for which the set of memory locations accessed cannot be determined in advance. Our implementations automatically detect and resolve con...
متن کاملWait-Free Dining Under Eventual Weak Exclusion
We present a wait-free solution to the generalized dining philosophers problem under eventual weak exclusion in environments subject to crash faults. Wait-free dining guarantees that every correct hungry process eventually eats, regardless of process crashes. Eventual weak exclusion (3WX ) actually allows scheduling mistakes, whereby mutual exclusion may be violated finitely-many times; for eac...
متن کاملOn Utility Accrual Processor Scheduling with Wait-Free Synchronization for Embedded Real-Time Software
We present the first wait-free utility accrual (UA) real-time scheduling algorithms for embedded real-time systems. UA scheduling algorithms allow application activities to be subject to time/utility function (TUF) time constraints, and optimize criteria such as maximizing the sum of the activities’ attained utilities. We present UA algorithms that use wait-free synchronization for mutually exc...
متن کاملCompetitive Freshness Algorithms for Wait-Free Data Objects
Wait-free concurrent data objects are widely used in multiprocessor systems and real-time systems. Their popularity results from the fact that they avoid locking and that concurrent operations on such data objects are guaranteed to finish in a bounded number of steps regardless of the other operations interference. The data objects allow high access parallelism and guarantee correctness of the ...
متن کاملAre lock-free concurrent algorithms practically wait-free? Citation
Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make progress. Unfortunately, designing wait-free algorithms is generally a very complex task, and the resulting algorithms are not always efficient. While ...
متن کاملSimple Wait-Free Snapshots for Real-Time Systems with Sporadic Tasks1
A wait-free algorithm for implementing a snapshot mechanism for real-time systems is presented in this paper. Snapshot mechanisms give the means to a real-time task to read a globally consistent set of variable values while other concurrent tasks are updating them. Such a mechanism can be used to solve a variety of communication and synchronisation problems, including system monitoring and cont...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995